SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A Kind of direct methods is presented for the solution of optimal control problems with state constraints.These methods are sequential quadratic programming methods.At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and Linear approximations to constraints is solved to get a search direction for a merit function.The merit function is formulated by augmenting the Lagrangian funetion with a penalty term.A line search is carried out along the search direction to determine a step length such that the merit function is decreased.The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadrade programming methods.     

转动系统的相对论性分析力学理论

本文讨论了转动相对论力学理论，主要是建立转动系统的相对论性分析力学理论·构造转动系统的相对论性广义动能函数Ｔｒ＝∑ｎｉ＝１Ｉ０ｉΓｉ２（１－１－θ·２ｉ／Γｉ２）和广义加速度能量函数Ｓｒ＝１２∑ｎｉ＝１Ｉｉ（θ·ｉ·θ¨ｉ）２Γｉ２－θ·２ｉ＋θ¨２ｉ，给出其Ｈａｍｉｌｔｏｎ原理和三种不同形式的Ｄ′Ａｌｅｍｂｅｒｔ原理；对于完整约束系统，建立了转动系统的相对论性Ｌａｇｒａｎｇｅ方程、Ｎｉｅｌｓｅｎ方程、Ａｐｐｅｌ方程和Ｈａｍｉｌｔｏｎ正则方程；对于非完整约束系统，建立了转动系统的相对论性Ｒｏｕｔｈ方程、Чаплыгин方程、Ｎｉｅｌｓｅｎ方程和Ａｐｐｅｌ方程；并给出转动系统的相对论性Ｎｏｅｔｈｅｒ守恒律     

On a Quadratic Optimization Problem with Equality Constraints

The constrained optimization problem with a quadratic cost functional and two quadratic equality constraints has been studied by Bar-on and Grasse, with positive-definite matrix in the objective. In this note, we shall relax the matrix in the objective to be positive semidefinite. A necessary and sufficient condition to characterize a local optimal solution to be global is established. Also, a perturbation scheme is proposed to solve this generalized problem.     

Stability criteria for controlled queueing systems

We give an almost complete classification of ergodicity and transience conditions for a general multi-queue system with the following features: arrivals form Poisson streams and there are various routing schemes for allocating arrivals to queues; the servers can be configured in a variety of ways; completed jobs can feed back into the system; the exponential service times and feedback probabilities depend upon the configuration of the servers (this model includes some types of multi-class queueing system); switching between service regimes is instantaneous. Several different levels of control of the service regimes are considered. Our results for the N-queue system require randomisation of service configurations but we have studied the two queue system in situations where there is less control. We use the semi-martingale methods described in Fayolle, Malyshev and Menshikov [3] and our results generalise Kurkova [8] and complement Foley and McDonald [4] and [5]. AMS 2000 subject classification: Primary: 90B22; Secondary: 60J10 90B15     

Equality and inequality constrained optimization algorithms with convergent stepsizes

In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker.     

YBO3:Eu荧光粉的水热法制备及形貌控制

用水热法在低于300℃成功地制备出具有不同形貌的YBO3:Eu3+荧光粉,其反应温度比固相反应了约800℃.研究了初始原料、pH值、反应温度、反应溶剂和催化剂等条件对目的产物形貌及粒度的,得到了具有Vaterite结构、粒度分布均匀的球形荧光粉的最佳合成工艺.在254nm激发下,水热法的球形Y0.95Eu0.05BO3荧光粉最强发射峰位于598nm处,属于Eu3+的5D0→7F1的跃迁,是固相反应所品的1.5倍.这些结果表明,在PDP和荧光灯等显示和照明用荧光粉的制备中水热法具有潜在的应用.     

Convex programs with an additional reverse convex constraint

A method is presented for solving a class of global optimization problems of the form (P): minimizef(x), subject toxD,g(x)0, whereD is a closed convex subset ofR ⁿ andf,g are convex finite functionsR ⁿ . Under suitable stability hypotheses, it is shown that a feasible point is optimal if and only if 0=max{g(x):xD,f(x)f( )}. On the basis of this optimality criterion, the problem is reduced to a sequence of subproblemsQ _k ,k=1, 2, ..., each of which consists in maximizing the convex functiong(x) over some polyhedronS _k . The method is similar to the outer approximation method for maximizing a convex function over a compact convex set.     

Qualitative estimation of the dependence of the number of energetic compounds on their oxygen coefficient

The ratio between the numbers of structural formulas of C,H,N,O-containing energetic compounds belonging to the classes of fuels (low values of the oxygen coefficientA), explosives (mediumA), and oxidants (highA values) was studied by a computer generation procedure. The number of the theoretically possible structural formulas was found to decrease rapidly on going from fuels to explosives and then to oxidants; this observation agrees with the data on the numbers of various energetic compounds currently used and proposed. The strategy of the search for new compounds with the specified properties is described in brief, and its applicability to the search for explosives and oxidants with a small (up to 12) number of atoms in a molecule is evaluated. Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 7, pp. 1304–1310, July, 1998.     

带缓冲串行生产系统预防性维护建模及运行参数优化研究

为了保证串行生产系统的产能和提高系统可靠性,提出了带缓冲区的串行生产系统预防性维护决策模型。首先,分析了生产线各执行单元可靠性和运行参数之间的关系,建立了考虑执行单元运行参数和缓冲库存的维护模型。在此基础上,结合串行生产线的特点,建立综合考虑维护成本、有效运行速度和缓冲库存的多目标优化函数。最后,构建启发式算法求解目标函数,并以串行包装生产线为例进行仿真实验分析,结果表明本文所建模型是有效且实用的。     

农业供应链金融能有效缓解企业的融资约束？——涉农企业参与精准扶贫的实证研究

农业供应链金融为涉农企业融资难问题提供了新思路。本文以上市涉农上市企业2016~2018年的财务数据为样本,探讨了农业供应链金融对缓解企业融资约束的影响,以及涉农企业参与精准扶贫对缓解融资约束的调节作用。研究发现:涉农企业普遍面临融资约束问题,而农业供应链金融显著缓解了涉农企业的融资约束,且对参与精准扶贫企业的融资约束缓解更为显著。本文揭示了:农业供应链金融能有效缓解涉农企业的融资约束问题,再次证明了农业供应链金融缓解涉农企业融资约束的重要性和必要性,拓展了供应链金融研究的领域,同时对企业参与精准扶贫,响应新时期涉农企业社会责任的具体要求,形成政府、企业等共同承担社会责任的多元化减贫治理机制,助力乡村振兴提供相应借鉴。